Bus Transport Process Networks with Arbitrary Launching Times
نویسندگان
چکیده
منابع مشابه
Optimization at All Launching Times
In the DE-STAR lab, we propose to use phased laser array with photon propellant in order to achieve significantly higher speed for the spacecraft. During the simulation, the laser is sometimes turned off to avoid cancellation of force or acceleration. However, if we shut off the laser accurately, the duration rises and drops even when the launch time is altered slightly, which makes the real im...
متن کاملPerfect quantum transport in arbitrary spin networks
Spin chains have been proposed as wires to transport information between distributed registers in a quantum information processor. Unfortunately, the challenges in manufacturing linear chains with engineered couplings has hindered experimental implementations. Here we present strategies to achieve perfect quantum information transport in arbitrary spin networks. Our proposal is based on the wea...
متن کاملSearch times with arbitrary detection constraints.
Random encounters in space are central to describing diffusion-limited reactions, animal foraging, search processes, and many other situations in nature. These encounters, however, are often constrained by the capacity of the searcher to detect and/or recognize its target. This can be due to limited binding and perception abilities of the searcher or hiding and avoiding mechanisms used by the t...
متن کاملBounding completion times of jobs with arbitrary release times and variable execution times
In many real-time systems, the workload can be characterized as a set of jobs with linear precedence constraints among them. Jobs often have variable execution times and arbitrary release times. We describe here three algorithms that can be used to compute upper bounds on completion times of such jobs scheduled on a priority-driven basis. The algorithmshave different performance and complexity....
متن کاملBounding Completion Times of Jobs with Arbitrary Release Times, Variable Execution Times and Resource Sharing
| The workload of many real-time systems can be characterized as a set of preemptable jobs with linear precedence constraints. Typically their execution times are only known to lie within a range of values. In addition jobs share resources and access to the resources must be synchronized to ensure the integrity of the system. This paper is concerned with the schedulability of such jobs when sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Polytechnica Hungarica
سال: 2021
ISSN: 1785-8860,2064-2687
DOI: 10.12700/aph.18.4.2021.4.7